Literal Reification
نویسندگان
چکیده
In this paper we introduce the pattern literal reification, a modelling technique to address scenarios, in which we need to bless particular literals, usually when applying data properties, in order to use them as subjects and/or full-fledged objects of semantic assertions.
منابع مشابه
Reified unit resolution and the failed literal rule
Unit resolution can simplify a cnf formula or detect an inconsistency by repeatedly assign the variables occurring in unit clauses. Given any cnf formula σ, we show that there exists a satisfiable cnf formula ψ with size polynomially related to the size of σ such that applying unit resolution to ψ simulates all the effects of applying it to σ. The formula ψ is said to be the reified counterpart...
متن کاملReified Literals: A Best Practice Candidate Design Pattern for Increased Expressivity in the Intelligence Community
Reifying literals clearly increases expressivity. But reified literals appear to waste memory, slow queries, and complicate graph-based models. We show where this practice can be comparable to unreified literals in these respects and we characterize the cost where it is not. We offer examples of how reification allows literals to participate in a variety of relations enabling a marked increase ...
متن کاملReview of Rollinls The Frankenstein Syndrome
This book is a defense of genetic engineering against "the Frankenstein thing." In his brief Introduction, Rollin tells us that "the Frankenstein story strikes a socially responsive chord, providing us with a way of articulating our fears and doubts about science and technology" (3-4). Nothing wrong with that, but "when and if the myth becomes reified or transformed into or equated with reality...
متن کاملReified Temporal Theories and How to Unreify Them
Reification of propositions expressing states, events, and properties has been widely advocated as a means of handling temporal reasoning in A I . The author proposes that such reification is both philosophically suspect and technically unnecessary. The reified theories of Allen and Shoham are examined and it is shown how they can be unreified. The resulting loss of expressive power can be rect...
متن کاملReification of Program Points for Visual Execution
Existing reification techniques for Java only allow for inspection and manipulation of Java programs on the class, object and method level, but not at the level of individual program points. In this paper we introduce a reification technique of program points based on source-tosource transformations. Our reification method allows for the association of arbitrary meta-information with program po...
متن کامل